Infinite Words with Well Distributed Occurrences
نویسندگان
چکیده
In this paper we introduce the well distributed occurrences (WDO) combinatorial property for infinite words, which guarantees good behavior (no lattice structure) in some related pseudorandom number generators. An infinite word u on a d-ary alphabet has the WDO property if, for each factor w of u, positive integer m, and vector v ∈ Zm, there is an occurrence of w such that the Parikh vector of the prefix of u preceding such occurrence is congruent to v modulo m. We prove that Sturmian words, and more generally Arnoux-Rauzy words and some morphic images of them, have the WDO property.
منابع مشابه
Aperiodic pseudorandom number generators based on infinite words
In this paper we study how certain families of aperiodic infinite words can be used to produce aperiodic pseudorandom number generators (PRNGs) with good statistical behavior. We introduce the well distributed occurrences (WELLDOC) combinatorial property for infinite words, which guarantees absence of the lattice structure defect in related pseudorandom number generators. An infinite word u on ...
متن کاملLyndon factorization of generalized words of Thue
The i-th symbol of the well-known infinite word of Thue on the alphabet {0,1} can be characterized as the parity of the number of occurrences of the digit 1 in the binary representation of i. Generalized words of Thue are based on counting the parity of occurrences of an arbitrary word w ∈ {0,1}∗−0∗ in the binary representation of i. We provide here the standard Lyndon factorization of some sub...
متن کاملAssociativity of Infinite Synchronized Shuffles and Team Automata
Motivated by different ways to obtain team automata from synchronizing component automata, we consider various definitions of synchronized shuffles of words. A shuffle of two words is an interleaving of their symbol occurrences which preserves the original order of these occurrences within each of the two words. In a synchronized shuffle, however, also two occurrences of one symbol, each from a...
متن کاملVariations of the Morse-Hedlund Theorem for k-Abelian Equivalence
In this paper we investigate local-to-global phenomena for a new family of complexity functions of infinite words indexed by k ∈ N1∪{+∞} where N1 denotes the set of positive integers. Two finite words u and v in A∗ are said to be k-abelian equivalent if for all x ∈ A∗ of length less than or equal to k, the number of occurrences of x in u is equal to the number of occurrences of x in v. This def...
متن کاملOn the Variety of Shapes in Digital Trees
Abstract We study the joint distribution of the number of occurrences of members of a collection of nonoverlapping motifs in digital data.We deal with finite and countably infinite collections. For infinite collections, the setting requires that we be very explicit about the specification of the underlying measure-theoretic formulation. We show that (under appropriate normalization) for such a ...
متن کامل